Finite groups with a given number of relative centralizers

We will study all finite groups and their subgroups with at most four relative centralizers.     

Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes

An identifying code is a subset of vertices of a graph with the property that each vertex is uniquely determined (identified) by its nonempty neighbourhood within the identifying code. When only vertices out of the code are asked to be identified, we get the related concept of a locating-dominating set. These notions are closely related to a number of similar and well-studied concepts such as the one of a test cover. In this paper, we study the decision problems Identifying Code and Locating-Dominating Set (which consist in deciding whether a given graph admits an identifying code or a locating-dominating set, respectively, with a given size) and their minimization variants Minimum Identifying Code and Minimum Locating-Dominating Set. These problems are known to be NP-hard, even when the input graph belongs to a number of specific graph classes such as planar bipartite graphs. Moreover, it is known that they are approximable within a logarithmic factor, but hard to approximate within any sub-logarithmic factor. We extend the latter result to the case where the input graph is bipartite, split or co-bipartite: both problems remain hard in these cases. Among other results, we also show that for bipartite graphs of bounded maximum degree (at least 3), the two problems are hard to approximate within some constant factor, a question which was open. We summarize all known results in the area, and we compare them to the ones for the related problem Dominating Set. In particular, our work exhibits important graph classes for which Dominating Set is efficiently solvable, but Identifying Code and Locating-Dominating Set are hard (whereas in all previous works, their complexity was the same). We also introduce graph classes for which the converse holds, and for which the complexities of Identifying Code and Locating-Dominating Set differ.     

The space of lines in cyclic covers of projective space

Take positive integers m, n and d. Let Y be an m-fold cyclic cover of ${\mathbb{P}}^n$ ramified over a general hypersurface $X\subset P^n$ of degree md. In this paper we study the space $F(Y)$ of lines in Y and show that it is smooth of dimension $2(n-1)-d(m-1)$ if $md>2n-3$ and $2(n-1)-d(m-1)\ge 0$. When $2(n-1)=d(m-1)$, our result gives a formula on the number of m-contact order lines of X (see Definition 1.2).     

Topological Minors of Cover Graphs and Dimension

We show that posets of bounded height whose cover graphs exclude a fixed graph as a topological minor have bounded dimension. This result was already proven by Walczak. However, our argument is entirely combinatorial and does not rely on structural decomposition theorems. Given a poset with large dimension but bounded height, we directly find a large clique subdivision in its cover graph. Therefore, our proof is accessible to readers not familiar with topological graph theory, and it allows us to provide explicit upper bounds on the dimension. With the introduced tools we show a second result that is supporting a conjectured generalization of the previous result. We prove that ‐free posets whose cover graphs exclude a fixed graph as a topological minor contain only standard examples of size bounded in terms of k.     

Gorenstein injective envelopes and covers over two sided noetherian rings

We prove that the class of Gorenstein injective modules is both enveloping and covering over a two sided noetherian ring such that the character modules of Gorenstein injective modules are Gorenstein flat. In the second part of the paper we consider the connection between the Gorenstein injective modules and the strongly cotorsion modules. We prove that when the ring R is commutative noetherian of finite Krull dimension, the class of Gorenstein injective modules coincides with that of strongly cotorsion modules if and only if the ring R is in fact Gorenstein.     

Torsions of 3-Dimensional Small Covers

In this paper,it is shown that for a 3-dimensional small cover M over a polytope P,there are only 2-torsions in H1(M;Z).Moreover,the mod 2 Betti number growth of finite covers of M is studied.     

Wedge Operations and Doubling Operations of Real Toric Manifolds

This paper deals with two things.First,the cohomology of canonical extensions of real topological toric manifolds is computed when coefficient ring G is a commutative ring in which 2 is unit in G.Second,the author focuses on a specific canonical extensions called doublings and presents their various properties.They include existence of infinitely many real topological toric manifolds admitting complex structures,and a way to construct infinitely many real toric manifolds which have an odd torsion in their cohomology groups.Moreover,some questions about real topological toric manifolds related to Halperin's toral rank conjecture are presented.     

爆炸成型弹丸贯穿混凝土的实验研究

介绍几种聚能装药对混凝土层的破坏效果，并对聚能装药的结构设计与破坏效果的相互关系进行了分析与讨论。文中重点对截卵形药型罩、亚半球变壁厚药型罩、双功能药型罩的装药结构、破甲能力及目标结构特性进行了研究。